In this paper, we present a method of constructing new families of LDPC blockcode ensembles formed by terminating irregular protograph-based LDPCconvolutional codes. Using the accumulate-repeat-by-4-jagged-accumulate (AR4JA)protograph as an example, a density evolution analysis for the binary erasurechannel shows that this flexible design technique gives rise to a largeselection of LDPC block code ensembles with varying code rates and thresholdsclose to capacity. Further, by means of an asymptotic weight enumeratoranalysis, we show that all the ensembles in this family also have minimumdistance that grows linearly with block length, i.e., they are asymptoticallygood.
展开▼
